github.com/klauspost/compress/zstd.bestFastEncoder.table (field)

18 uses

	github.com/klauspost/compress/zstd (current package)
		enc_best.go#L71: 	table         [bestShortTableSize]prevEntry
		enc_best.go#L89: 			e.table = [bestShortTableSize]prevEntry{}
		enc_best.go#L96: 		for i := range e.table[:] {
		enc_best.go#L97: 			v := e.table[i].offset
		enc_best.go#L98: 			v2 := e.table[i].prev
		enc_best.go#L110: 			e.table[i] = prevEntry{
		enc_best.go#L206: 		candidateS := e.table[nextHashS]
		enc_best.go#L292: 		e.table[nextHashS] = prevEntry{offset: s + e.cur, prev: candidateS.offset}
		enc_best.go#L306: 			candidateS = e.table[hashLen(cv>>8, bestShortTableBits, bestShortLen)]
		enc_best.go#L322: 				improve(&best, e.table[hashLen(cv2>>8, bestShortTableBits, bestShortLen)].offset-e.cur, s+3, uint32(cv2>>8), -1)
		enc_best.go#L387: 				e.table[h1] = prevEntry{offset: off, prev: e.table[h1].offset}
		enc_best.go#L447: 			e.table[h1] = prevEntry{offset: off, prev: e.table[h1].offset}
		enc_best.go#L484: 	if len(e.dictTable) != len(e.table) || dictChanged {
		enc_best.go#L485: 		if len(e.dictTable) != len(e.table) {
		enc_best.go#L486: 			e.dictTable = make([]prevEntry, len(e.table))
		enc_best.go#L552: 	copy(e.table[:], e.dictTable)